Feature selection via binary simultaneous perturbation stochastic approximation

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Feature selection via binary simultaneous perturbation stochastic approximation

Feature selection (FS) has become an indispensable task in dealing with today’s highly complex pattern recognition problems with massive number of features. In this study, we propose a new wrapper approach for FS based on binary simultaneous perturbation stochastic approximation (BSPSA). This pseudo-gradient descent stochastic algorithm starts with an initial feature vector and moves toward the...

متن کامل

Adaptive initial step size selection for Simultaneous Perturbation Stochastic Approximation.

A difficulty in using Simultaneous Perturbation Stochastics Approximation (SPSA) is its performance sensitivity to the step sizes chosen at the initial stage of the iteration. If the step size is too large, the solution estimate may fail to converge. The proposed adaptive stepping method automatically reduces the initial step size of the SPSA so that reduction of the objective function value oc...

متن کامل

Simultaneous perturbation stochastic approximation of nonsmooth functions

A simultaneous perturbation stochastic approximation (SPSA) method has been developed in this paper, using the operators of perturbation with the Lipschitz density function. This model enables us to use the approximation of the objective function by twice differentiable functions and to present their gradients by volume integrals. The calculus of the stochastic gradient by means of this present...

متن کامل

Simultaneous perturbation stochastic approximation for automatic speech recognition

While both the acoustic model and the language model in automatic speech recognition are typically well-trained on the target domain, the free parameters of the decoder itself are often set manually. In this paper, we investigate in how far a stochastic approximation algorithm can be employed to automatically determine the best parameters, especially if additional timeconstraints are given on u...

متن کامل

Matrix Conditioning and Adaptive Simultaneous Perturbation Stochastic Approximation Method

This paper proposes a modification to the simultaneous per tu rba t ion stochastic approximation (SPSA) methods based on the comparisons made between the first o rder and the second order SPSA (1SPSA and 2SPSA) algori thms f rom the perspective of loss function Hessian. At finite iterations, the convergence rate depends on the matr ix conditioning of the loss function Hessian. It is shown that ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Pattern Recognition Letters

سال: 2016

ISSN: 0167-8655

DOI: 10.1016/j.patrec.2016.03.002